#include <iostream>
#include <vector>
#include <string>
using namespace std;

class Solution
{
public:
    int minimumDeleteSum(string s1, string s2)
    {
        int m = s1.size(), n = s2.size();
        vector<vector<int>> dp(m + 1, vector<int>(n + 1));

        for (int i = 1; i <= m; i++)
            for (int j = 1; j <= n; j++)
            {
                dp[i][j] = max(dp[i][j - 1], dp[i - 1][j]);
                if (s1[i - 1] == s2[j - 1])
                    dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + s1[i - 1]);
            }
        int sum = 0;
        for (auto a : s1) sum += a;
        for (auto a : s2) sum += a;
        return sum - 2 * dp[m][n];
    }
};

void Test01()
{

}

int main()
{
    Test01();
    return 0;
}